Top-Down Nearly-Context-Sensitive Parsing

نویسنده

  • Eugene Charniak
چکیده

We present a new syntactic parser that works left-to-right and top down, thus maintaining a fully-connected parse tree for a few alternative parse hypotheses. All of the commonly used statistical parsers use context-free dynamic programming algorithms and as such work bottom up on the entire sentence. Thus they only find a complete fully connected parse at the very end. In contrast, both subjective and experimental evidence show that people understand a sentence word-to-word as they go along, or close to it. The constraint that the parser keeps one or more fully connected syntactic trees is intended to operationalize this cognitive fact. Our parser achieves a new best result for topdown parsers of 89.4%,a 20% error reduction over the previous single-parser best result for parsers of this type of 86.8% (Roark, 2001). The improved performance is due to embracing the very large feature set available in exchange for giving up dynamic programming.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Top-Down Parsing with Parsing Contexts A Simple Approach to Context-Sensitive Parsing

The domain of context-free languages has been extensively explored and there exist numerous techniques for parsing (all or a subset of) context-free languages. Unfortunately, some programming languages are not context-free. Using standard context-free parsing techniques to parse a context-sensitive programming language poses a considerable challenge. Implementors of programming language parsers...

متن کامل

Title Consideration on Syntactic Analyses for a Speech

SUMMARY In this paper, we compared the left-to-right & top-down parsing strategy with the island-driven & botom-up strategy by using a simulated phoneme recognizer. The both strategies adopted the beam search. The syntactic constraints were represented by a context-free grammar. The word lattice for an utterrance was generated by a word spotting algorithm from an ambiguous phoneme sequence. The...

متن کامل

Research on the Top-Down Parsing Method for Context-Sensitive Graph Grammars

The parsing problem is one of the key problems of graph grammars. The typical parsing algorithm uses the bottom-up method. The time-complexity of this method is high, and it is difficult to apply. In order to reduce the time-complexity, this paper uses the top-down method for parsing. This method avoids the subgraph isomorphism judgment and selects the productions specifically, so that the time...

متن کامل

Defining and Parsing Visual Languages with Layered Graph Grammars

Sentences of Visual Languages (VLs) may often be regarded as assemblies of pictorial objects with spatial relationships like “above” or “contains” between them, i.e. their representations are a kind of directed graphs. Such a spatial relationship graph is often complemented by a more abstract graph, which provides information about the syntax (and the semantics) of the visual sentence in a more...

متن کامل

Top-Down Parsing of Conjunctive Languages

This paper generalizes the notion of a strong LL(k) context-free grammar for the case of conjunctive grammars and develops a top-down parsing algorithm for the resulting language family. A top-down parser of a conjunctive language attempts to construct a derivation of the input string, at each step using a nite lookahead to determine which grammar rule to apply. Fragments of formulae that form ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010